Pattern Matching Image Compression with Predication Loop: Preliminary Experimental Results

نویسندگان

  • Denis Arnaud
  • Wojciech Szpankowski
چکیده

Recently, a novel image compression technique based on pattern matching was proposed, namely Pattern Matching Image Compression (PMIC). Basically, it is a lossy extension of the well known Lempel-Ziv scheme. It was proved that such an extension leads to a suboptimal compression, and that the compression ratio can as low as the so called R enyi entropy. Success of PMIC crucially depends on several enhancements such as searching for reverse approximate matching, recognizing substrings in images that are additively shifted versions of each other, introducing a variable and adaptive maximum distortion level, and so forth. In this paper, we introduce another enhancement, namely, predictive coding. More importantly, we implement Di erential Predictive Code Modulation (DPCM) within PMIC scheme. We report here some preliminary experimental results which show that PMIC enhanced by prediction can improve compression ratio for good quality images as well as speed of compression for PMIC. This work was supported by NSF Grants NCR-9415491 and CCR-9201078.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Patternmatching Image Compressionwith Predication

Recently, a novel image compression technique based on pattern matching was proposed, namely Pattern Matching Image Compression (PMIC). Basically, it is a lossy extension of the well known Lempel-Ziv scheme. It was proved that such an extension leads to a suboptimal compression, and that the compression ratio can as low as the so called R enyi entropy. Success of PMIC crucially depends on sever...

متن کامل

Entropy-based pattern matching for document image compression

In this paper, we introduce a pattern matching algorithm used in document image compression. This pattern matching algorithm uses the cross entropy between two patterns as the criterion for a match. We use a physical model which is based on the nite resolution of the scanner (spatial sampling error) to estimate the probability values used in cross entropy calculation. Experimental results show ...

متن کامل

Visual Pattern Image Coding by a Morphological Approach (RESEARCH NOTE)

This paper presents an improvement of the Visual Pattern image coding (VPIC) scheme presented by Chen and Bovik in [2] and [3]. The patterns in this improved scheme are defined by morphological operations and classified by absolute error minimization. The improved scheme identifies more uniform blocks and reduces the noise effect. Therefore, it improves the compression ratio and image quality i...

متن کامل

Pattern Matching Image Compression: Algorithmic and Empirical Results

ÐWe propose a nontransform image compression scheme based on approximate one-dimensional pattern matching that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately occurs in the already processed image (e.g., in the sense o...

متن کامل

Compressed Pattern Matching for Predictive Lossless Image Encoding

Pattern matching in compressed image domain is a new topic in computer science. Many works have been reported for pattern matching for compressed text and for lossy compressed image. However, searching of images in lossless compressed domain is almost a blank area and needs to be explored. Lossless image compression is widely used in areas such as medical images, satellite images, geometric ima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996